A Highly Optimized Skeleton for Unbalanced and Deep Divide-And-Conquer Algorithms on Multi-Core Clusters

Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG [Abstract] Efficiently implementing the divide-and-conquer pattern of parallelism in distributed memory systems is very relevant, given its ubiquity, and difficult, given its recursive nature and the need to exchange tasks and data among the processors. This task is noticeably further complicated in the presence of multi-core systems, where hybrid parallelism must be exploited to attain the best performance, and when unbalanced and deep workloads are considered, as additional measures must be taken to load balance and avoid deep recursion problems. In this manuscript a parallel skeleton that fulfills all these requirements while providing high levels of usability is presented. In fact, the evaluation shows that our proposal is on average 415.32% faster than MPI codes and 229.18% faster than MPI + OpenMP benchmarks, while offering an average improvement in the programmability metrics of 131.04% over MPI alternatives and 155.18% over MPI + OpenMP solutions.This research was supported by the Ministry of Science and Innovation of Spain (PID2019-104184RB-I00 and PID2019-104834GB-I00, AEI/FEDER/EU, 10.13039/501100011033) and the predoctoral Grant of Millán Álvarez Ref. BES-2017-081320), and by the Xunta de Galicia co-founded by the European Regional Development Fund (ERDF) under the Consolidation Programme of Competitive Reference Groups (ED431C 2018/19 and ED431C 2021/30). We acknowledge also the support from the Centro Singular de Investigación de Galicia “CITIC” and the Centro Singular de Investigación en Tecnoloxías Intelixentes “CiTIUS”, funded by Xunta de Galicia and the European Union (European Regional Development Fund- Galicia 2014-2020 Program), by Grants ED431G 2019/01 and ED431G 2019/04. We also acknowledge the Centro de Supercomputación de Galicia (CESGA). Open Access funding provided thanks to the CRUE-CSIC agreement with Springer NatureXunta de Galicia; ED431C 2018/19Xunta de Galicia; ED431C 2021/30Xunta de Galicia; ED431G 2019/01Xunta de Galicia; ED431G 2019/0

Assessment, Design and Implementation of a Private Cloud for MapReduce Applications

[Abstract] Scientific computation and data intensive analyses are ever more frequent. On the one hand, the MapReduce programming model has gained a lot of attention for its applicability in large parallel data analyses and Big Data applications. On the other hand, Cloud computing seems to be increasingly attractive in solving these computing problems that demand a lot of resources. This paper explores the potential symbiosis between MapReduce and Cloud Computing, in order to create a robust and scalable environment to execute MapReduce workflows regardless of the underlaying infrastructure. The main goal of this work is to provide an easy-to-install interface, so as non-expert scientists can deploy a suitable testbed for their MapReduce experiments on local resources of their institution. Testing cases were performed in order to evaluate the required time for the whole executing process on a real cluster

A Parallel Skeleton for Divide-and-conquer Unbalanced and Deep Problems

This is a post-peer-review, pre-copyedit version of an article published in International Journal of Parallel Programming. The final authenticated version is available online at: https://doi.org/10.1007/s10766-021-00709-y.[Abstract] The Divide-and-conquer (D&C) pattern appears in a large number of problems and is highly suitable to exploit parallelism. This has led to much research on its easy and efficient application both in shared and distributed memory parallel systems. One of the most successful approaches explored in this area consists of expressing this pattern by means of parallel skeletons which automate and hide the complexity of the parallelization from the user while trying to provide good performance. In this paper, we tackle the development of a skeleton oriented to the efficient parallel resolution of D&C problems with a high degree of imbalance among the subproblems generated and/or a deep level of recurrence. The skeleton achieves in our experiments average speedups between 11 and 18% higher than those of other solutions, reaching a maximum speedup of 78% in some tests. Nevertheless, the new proposal requires an average of between 13 and 29% less programming effort than the usual alternatives.Ministerio de Ciencia e Innovación de España; TIN2016-75845-PMinisterio de Ciencia e Innovación de España; PID2019-104184RB-I00Ministerio de Ciencia e Innovación de España; PID2019-104834GB-I00Ministerio de Ciencia e Innovación de España; 10.13039/501100011033Ministerio de Ciencia e Innovación de España; BES-2017-081320Xunta de Galicia; ED431C 2017/04Xunta de Galicia; ED431C 2018/19Xunta de Galicia; ED431G 2019/01Xunta de Galicia; ED431G 2019/0

Biologia e tabela de vida de fertilidade de Planococcus citri em diferentes estruturas vegetativas de cultivares de videira Biology and fertility life table of Planococcus citri in different vegetative structures of grape cultivars

O objetivo deste trabalho foi estudar a biologia e a tabela de vida de fertilidade de Planococcus citri, em folhas de videira das cultivares Cabernet Sauvignon, Itália e Isabel, em bagas de uva 'Itália' e em raízes da 'Isabel' e dos porta-enxertos 101-14 e IAC-572. Os seguintes parâmetros foram avaliados: duração e viabilidade dos estágios de ovo e ninfa; e fecundidade e longevidade dos adultos. Em raízes do porta-enxerto IAC-572, a cochonilha não completou o ciclo biológico. Em bagas de uva 'Itália', o inseto completou a fase de ninfa, porém os adultos foram inférteis. Em folhas das diferentes cultivares, a duração média do período de ovo a adulto dos machos foi de 24,63 dias, com viabilidade de 32%, enquanto as fêmeas duraram 32 dias com viabilidade de 56%. Em raízes, a duração do ciclo biológico de fêmeas e machos foi de 32,45 e 29,50 dias, respectivamente. Em folhas, a fecundidade foi de 67,27, 66,09 e 53,33 ovos por fêmea, nas cultivares Cabernet Sauvignon, Isabel e Itália, respectivamente. Nas raízes foram obtidos 30,4 e 70,0 ovos por fêmea, no porta-enxerto 101-14 e na cultivar Isabel, respectivamente.<br>The objective of this work was to study the biology and fertility life table of Planococcus citri in leaves of the grape cultivars Cabernet Sauvignon, Itália and Isabel, in berries of 'Itália', in roots of 'Isabel' and 101-14 and IAC-572 rootstocks. The following parameters were evaluated: duration and viability of the egg and nymph stages; and fertility and longevity of the adults. On berries of 'Itália', the insect completed the nymph phase, however the adults were infertile. On roots of the rootstock IAC-572, citrus mealybug was unable to develop. On leaves of the grape cultivars, the period of egg to adult males was 24.63 days, with viability of 32%, while females lasted 32 days with viability of 56%. On roots, the duration of the cycle of females and males was 32.45 and 29.50 days, respectively. For females fed on leaves, the fertility rate was 67.27, 66.09 and 53.33 eggs per female, in 'Cabernet Sauvignon', 'Isabel' and 'Itália', respectively; while on roots, fertility was 30.4 e 70.0 eggs per female, in the rootstock 101-14 and in the cultivar Isabel, respectively